Efficient Bounding Volume Hierarchies for Hair Simulation
نویسندگان
چکیده
We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approach based on Grassmanian spaces which allows for a systematic generation of normal sets for arbitrary k. This enables us to empirically determine optimal values of k for collision detection based on DOP hierarchies.
منابع مشابه
Adaptive Bounding Volume Hierarchies for Efficient Collision Queries
The need for efficient interference detection frequently arises in computer graphics, robotics, virtual prototyping, surgery simulation, computer games, and visualization. To prevent bodies passing directly through each other, the simulation system must be able to track touching or intersecting geometric primitives. In interactive simulations, in which millions of geometric primitives may be in...
متن کاملCollision Detection in Densely Packed Fiber Assemblies with Application to Hair Modeling
In this paper we investigate the application of bounding volume hierarchies in collision detection among densely packed fiber assemblies like hair strands or cable looms. In particular, we glance at collision detection algorithms with sub-quadratic upper bound and their practicability and performance in complex dynamic hair scenes. Unlike common collision detection techniques our approach explo...
متن کاملFast Distance Queries with Rectangular Swept Sphere Volumes
We present new distance computation algorithms using hierarchies of rectangular swept spheres. Each bounding volume of the tree is described as the Minkowski sum of a rectangle and a sphere, and fits tightly to the underlying geometry. We present accurate and efficient algorithms to build the hierarchies and perform distance queries between the bounding volumes. We also present traversal techni...
متن کاملCollision Detection Using Bounding-Volume Hierarchies in Urban Simulation
Performing fast and accurate collision detection between geometric models is still most open problems in modeling, robotics, manufacturing and computer-simulated environments. Most of previous method seems to have their own specification and restricted to a specific geometric models. For example, convex polytopes tend to solve accuracy problems but left behind the speed of collision detection. ...
متن کاملVirtual Reality Interaction and Physical Simulation Approximate collision response using closest feature maps
In this paper we consider the novel idea of closest feature maps (CFMs) applied to refinable collision response in order to address the potential issues and problems associated with over approximation of contact information for time-critical collision detection schemes that utilise sphere-tree bounding volume hierarchies. Existing solutions to time-critical collision handling can at times suffe...
متن کامل